. The R package for the K medoids algorithm is ClusterR and

nction for the K-medoids algorithm is Cluster_Medoids.

37 shows an application of this algorithm to the nine-cluster data

different cluster numbers.

The K-medoids algorithm applied to the nine-cluster data with nine cluster

ensity-based clustering algorithm is a non-parametric algorithm

al., 1996]. The algorithm groups together highly packed data

to clusters. These highly packed data points are also called the

eighbours. The clustering boundaries are lied in the low-density

The algorithm has been applied to analyse DNA data [Liu, et al.,

d MR tractography data [Choi, et al., 2020]. The R package for

ased cluster analysis is dbscan.

gene essentiality pattern discovery problem

e data

sposon sequencing technology can insert a transposon into a

millions of times, hence generating millions of mutants. A mutant

s an insertion site in a gene because such an insertion site may

he function of the gene. If the function of a gene is not disrupted